An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
نویسندگان
چکیده
In this paper we present an efficient algorithm for computing a sparse null space basis for a full row rank matrix. We first apply the ideas of the Markowitz’s pivot selection criterion to a rank reducing algorithm to propose an efficient algorithm for computing sparse null space bases of full row rank matrices. We then describe how we can use the Dulmage-Mendelsohn decomposition to make the resulting algorithm more efficient.
منابع مشابه
Applications of the Dulmage-mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
In this paper, we consider the use of the Dulmage-Mendelsohn decomposition and network ow on bipartite graphs to improve a graph bisection partition. Given a graph partition S; B; W ] with a vertex separator S and two disconnected components B and W , diierent strategies are considered based on the Dulmage-Mendelsohn decomposition to reduce the separator size jSj and/or the imbalance between B ...
متن کاملMixed Matrices — Irreducibility and Decomposition — ∗
This paper surveys mathematical properties of (layered-) mixed matrices with emphasis on irreducibility and block-triangular decomposition. A matrix A is a mixed matrix if A = Q + T , where Q is a “constant” matrix and T is a “generic” matrix (or formal incidence matrix) in the sense that the nonzero entries of T are algebraically independent parameters. A layered mixed (or LM-) matrix is a mix...
متن کاملAlgorithm xxx: Reliable Calculation of Numerical Rank, Null Space Bases, Pseudoinverse Solutions, and Basic Solutions using SuiteSparseQR
The SPQR RANK package contains routines that calculate the numerical rank of large, sparse, numerically rank-deficient matrices. The routines can also calculate orthonormal bases for numerical null spaces, approximate pseudoinverse solutions to least squares problems involving rankdeficient matrices, and basic solutions to these problems. The algorithms are based on SPQR from SuiteSparseQR (ACM...
متن کاملMatching structure of symmetric bipartite graphs and a generalization of Pólya's problem
A bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. This paper investigates matching structure of symmetric bipartite graphs. We first apply the Dulmage-Mendelsohn decomposition to a symmetric bipartite graph. The resulting components, which are matching-covered, turn out to have symmetry. We then decompose a matching-covered bipartite graph via an ear de...
متن کاملA fast recursive orthogonalization scheme for the Macaulay matrix
In this article we present a fast recursive orthogonalization scheme for two important subspaces of the Macaulay matrix: its row space and null space. It requires a graded monomial ordering and exploits the resulting structure of the Macaulay matrix induced by this graded ordering. The resulting orthogonal basis for the row space will retain a similar structure as the Macaulay matrix and is as ...
متن کامل